Generalized Partitioned Quantum Cellular Automata and Quantization of Classical CA

نویسندگان

  • Shuichi Inokuchi
  • Yoshihiro Mizoguchi
چکیده

In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstratethe condition of local transition functions, which induce a global transition of well-formed QCA. Following the results, extending a natural correspondence of classical cells and quantum cells to the correspondence of classical CA and QCA, we have the condition of classical CA such that CA generated by quantization of its cells is well-formed QCA. Finally we report some results of computer simulations of quantization of classical CA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Partitioned Quantum Cellular Automata and Quantumization of Classical CA

J. Watrous introduced the notion of quantum cellular automata(QCA) and showed that any quantum Turing machine can be efficiently simulated by a QCA with constant slowdown in 1995. CA with quantum cells is well-formed QCA if and only if its global transition function is unitary. Generally quantumization of cells of a classical CA dose not make it become QCA, because usually classical CA dose not...

متن کامل

On Quantum Cellular Automata

In recent work [1] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with “...

متن کامل

On Quantum Cellular Automata

In recent work [1] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with “...

متن کامل

On Quantum Cellural Automata

In recent work [1] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellural automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and so there is a question about quantum CA derived from more general, standard model of classical CA. In present work is considered an approach to definition of a scheme with “...

متن کامل

Design of low power random number generators for quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA.  Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJUC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2005